On the Value Problem in Weighted Timed Games
نویسندگان
چکیده
A weighted timed game is a timed game with extra quantitative information representing e.g.energy consumption. Optimizing the weight for reaching a target is a natural question, which hasalready been investigated for ten years. Existence of optimal strategies is known to be undecidablein general, and only very restricted classes of games have been identified for which optimal costand almost-optimal strategies can be computed. In this paper, we show that the value problemis undecidable in weighted timed games. We then introduce a large subclass of weighted timedgames (for which the undecidability proof above applies), and provide an algorithm to computearbitrary approximations of the value in such games. To the best of our knowledge, this is thefirst approximation scheme for an undecidable class of weighted timed automata. 1998 ACM Subject Classification D.2.4
منابع مشابه
Optimal Reachability in Divergent Weighted Timed Games
Weighted timed games are played by two players on a timed automaton equipped with weights: one player wants to minimise the accumulated weight while reaching a target, while the other has an opposite objective. Used in a reactive synthesis perspective, this quantitative extension of timed games allows one to measure the quality of controllers. Weighted timed games are notoriously difficult and ...
متن کاملRobust Weighted Timed Automata and Games
Weighted timed automata extend timed automata with cost variables that can be used to model the evolution of various quantities. Although cost-optimal reachability is decidable (in polynomial space) on this model, it becomes undecidable on weighted timed games. This paper studies cost-optimal reachability problems on weighted timed automata and games under robust semantics. More precisely, we c...
متن کاملOn the optimal reachability problem in weighted timed automata and games
In these notes, we survey works made on the models of weighted timed automata and games, and more specifically on the optimal reachability problem.
متن کاملFuzzy transferable-utility games: a weighted allocation and related results
By considering the supreme-utilities among fuzzy sets and the weights among participants simultaneously, we introduce the supreme-weighted value on fuzzy transferable-utility games. Further, we provide some equivalent relations to characterize the family of all solutions that admit a potential on weights. We also propose the dividend approach to provide alternative viewpoint for the potential a...
متن کاملOn the optimal reachability problem
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infimum cost as well as a supremum cost. We show that this problem is PSPACE-COMPLETE. Our proof uses techniques of linear programming, and thus exploits an important property of optimal runs : their time-transitions use a...
متن کامل